REDUCTION OF FREE INDEPENDENCE TO TENSOR INDEPENDENCE
نویسندگان
چکیده
منابع مشابه
2 8 Fe b 20 05 REDUCTION OF FREE INDEPENDENCE TO TENSOR INDEPENDENCE
In the hierarchy of freeness construction, free independence was reduced to tensor independence in the weak sense of convergence of moments. In this paper we show how to reduce free independence to tensor independence in the strong sense. We construct a suitable unital *-algebra of closed operators ‘affiliated’ with a given unital *-algebra and call the associated closure ‘monotone’. Then we pr...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملPropositional Independence Conditional independence
Independence – the study of what is relevant to a given problem of reasoning – is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and two more restricted forms of it, called strong conditional independence and perfect conditional independence. Many characterizations and proper...
متن کاملIndependence complexes of claw-free graphs
We study the class of independence complexes of claw-free graphs. The main theorem give good bounds on the connectivity of these complexes, given bounds for a few subcomplexes of the same class. Two applications are presented. Firstly, we show that the independence complex of a claw-free graph with n vertices and maximal degree d is (cn/d + ε)–connected, where c = 2/3. This can be compared with...
متن کاملApproximating independence polynomials of claw-free graphs
Matchings in graphs correspond to independent sets in the corresponding line graphs. Line graphs are an important subclass of claw-free graphs. Hence studying independence polynomials of claw-free graphs is a natural extension of studying matching polynomials of graphs. We extend a result of Bayati et.al. showing a fully polynomial time approximation scheme (FPTAS) for computing the independenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Infinite Dimensional Analysis, Quantum Probability and Related Topics
سال: 2004
ISSN: 0219-0257,1793-6306
DOI: 10.1142/s0219025704001682